Node-Independent Spanning Trees in Gaussian Networks
نویسندگان
چکیده
Gaussian network is known to be an alternative to toroidal network since it has the same number of nodes with less diameter, which makes it perform better than toroidal network. Spanning trees are said to be independent if all trees are rooted at the same node r and for any other node u, the nodes of the paths from r to u in all trees are distinct except the nodes r and u. In this paper, we investigate the problem of finding node independent spanning trees in
منابع مشابه
Providing a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملA Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes∗
In 1989, Zehavi and Itai [46] proposed the following conjecture: a k-connected graph G must possess k independent spanning trees (ISTs for short) with an arbitrary node as the common root. An n-dimensional twisted cube, denoted by TQn, is a variation of hypercubes with connectivity n to achieving some improvements of structure properties. Recently, Yang [42] proposed an algorithm for constructi...
متن کاملIndependent spanning trees in crossed cubes
A set of spanning trees in a graph is said to be independent (ISTs for short) if all the trees are rooted at the same node r and for any other node v(6= r), the paths from v to r in any two trees are nodedisjoint except the two end nodes v and r. For an n-connected graph, the independent spanning trees problem asks to construct n ISTs rooted at an arbitrary node of the graph. Recently, Zhang et...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 109 شماره
صفحات -
تاریخ انتشار 2017